Long-Distance Licensing in Harmonic Grammar

Licensing in Multiple Contexts: An Argument for Harmonic Grammar

Long-Distance Dependencies and Applicative Universal Grammar

To deal with long-distance dependencies, Applicative Universal Grammar (AUG) proposes a new type of categorial rides, called superposition rules. We compare the AUG rules with the alternative rules of Steedman's Combinatery Categorial Grammar (CCG) (Steedman, 1987, 1988, 1990; Szabolcsi, 1987; Ades and Steedman, 1982). In contrast to Steedtmm's rules, the AUG rules are free from inconsistencies...

Harmonic Grammar with Harmonic Serialism∗

Loss of restrictiveness through arithmetic: Concern is well-founded here. As we have shown, however, recourse to the full-blown power of numerical optimization is not required. . . In Optimality Theory, constraints are ranked, not weighted: harmonic evaluation involves the abstract algebra of order relations rather than numerical adjudication between quantities. ∗This research would not have be...

Harmonic grammar with linear programming ∗

We show that Harmonic Grammars (HGs) translate into linear systems and are thus solvable using the simplex algorithm, an efficient, widely-deployed optimization algorithm that is guaranteed to deliver the optimal solution if there is one and to detect when no solution exists. Our associated software package HaLP provides a practical tool for studying even large and complex HGs. We provide an in...

Varieties of Noisy Harmonic Grammar

Noisy Harmonic Grammar (NHG) is a framework for stochastic grammars that uses the GEN-cum-EVAL system originated in Optimality Theory. As a form of Harmonic Grammar, NHG outputs as winner the candidate with the smallest harmonic penalty (weighted sum of constraint violations). It is stochastic because at each “evaluation time,” constraint weights are nudged upward or downward by a random amount...